package programmercarl.动态规划.C46;

class Solution {
    public int maxSubArray(int[] nums) {
        //dp含义
        int[] dp = new int[nums.length];
        //dp初始化
        dp[0]=nums[0];
        int res=nums[0];
        //dp取值为
        for (int i = 1; i <nums.length ; i++) {
            dp[i]=Math.max(dp[i-1]+nums[i],nums[i]);
            res = Math.max(res, dp[i]);
        }
        return res;
    }
}